0.10/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.10/0.12 % Command : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC 0.12/0.33 % Computer : n007.cluster.edu 0.12/0.33 % Model : x86_64 x86_64 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.12/0.33 % Memory : 8042.1875MB 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 0.12/0.33 % CPULimit : 1200 0.12/0.33 % WCLimit : 120 0.12/0.33 % DateTime : Tue Jul 13 11:31:19 EDT 2021 0.12/0.34 % CPUTime : 0.12/0.34 % Number of cores: 8 0.19/0.34 % Python version: Python 3.6.8 0.19/0.34 # Version: 2.6rc1-ho 0.19/0.34 # No SInE strategy applied 0.19/0.34 # Trying AutoSched0 for 59 seconds 59.09/59.34 # AutoSched0-Mode selected heuristic G_E___208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN 59.09/59.34 # and selection function SelectComplexExceptUniqMaxHorn. 59.09/59.34 # 59.09/59.34 # Preprocessing time : 0.029 s 59.09/59.34 # Presaturation interreduction done 59.18/59.43 # No success with AutoSched0 59.18/59.43 # Trying AutoSched1 for 26 seconds 85.22/85.44 # AutoSched1-Mode selected heuristic H_____102_C18_F1_PI_AE_Q4_CS_SP_PS_S5PRR_S2S 85.22/85.44 # and selection function SelectNewComplexAHP. 85.22/85.44 # 85.22/85.44 # Preprocessing time : 0.014 s 85.22/85.44 # Presaturation interreduction done 85.31/85.52 # No success with AutoSched1 85.31/85.52 # Trying AutoSched2 for 8 seconds 93.27/93.52 # AutoSched2-Mode selected heuristic G_E___100_C18_F1_PI_AE_Q4_CS_SP_S0Y 93.27/93.52 # and selection function SelectMaxLComplexAvoidPosPred. 93.27/93.52 # 93.27/93.52 # Preprocessing time : 0.013 s 93.27/93.55 # No success with AutoSched2 93.27/93.55 # Trying AutoSched3 for 7 seconds 100.35/100.55 # AutoSched3-Mode selected heuristic G_E___301_C18_F1_URBAN_S5PRR_RG_S04BN 100.35/100.55 # and selection function PSelectComplexExceptUniqMaxHorn. 100.35/100.55 # 100.35/100.55 # Preprocessing time : 0.014 s 100.35/100.57 # No success with AutoSched3 100.35/100.57 # Trying AutoSched4 for 5 seconds 100.39/100.65 # AutoSched4-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S013I 100.39/100.65 # and selection function PSelectGroundNegLit. 100.39/100.65 # 100.39/100.65 # Preprocessing time : 0.013 s 100.39/100.65 # Presaturation interreduction done 100.39/100.65 100.39/100.65 # Proof found! 100.39/100.65 # SZS status Theorem 100.39/100.65 # SZS output start CNFRefutation 100.39/100.65 thf(satz39, axiom, ![X4:frac, X5:frac, X6:frac]:((eq @ X4 @ X6<=eq @ X5 @ X6)<=eq @ X4 @ X5), file('/export/starexec/sandbox/benchmark/theBenchmark.p', satz39)). 100.39/100.65 thf(satz67c, conjecture, eq @ (pf @ y @ (fr @ (ind @ (^[X1:nat]:(ts @ (num @ x) @ (den @ y))=(pl @ (ts @ (num @ y) @ (den @ x)) @ X1))) @ (ts @ (den @ x) @ (den @ y)))) @ x, file('/export/starexec/sandbox/benchmark/theBenchmark.p', satz67c)). 100.39/100.65 thf(satz56, axiom, ![X4:frac, X5:frac, X6:frac, X10:frac]:((eq @ X6 @ X10=>eq @ (pf @ X4 @ X6) @ (pf @ X5 @ X10))<=eq @ X4 @ X5), file('/export/starexec/sandbox/benchmark/theBenchmark.p', satz56)). 100.39/100.65 thf(satz37, axiom, ![X4:frac]:eq @ X4 @ X4, file('/export/starexec/sandbox/benchmark/theBenchmark.p', satz37)). 100.39/100.65 thf(satz29, axiom, ![X11:nat, X12:nat]:(ts @ X11 @ X12)=(ts @ X12 @ X11), file('/export/starexec/sandbox/benchmark/theBenchmark.p', satz29)). 100.39/100.65 thf(oneax, axiom, ![X3:nat > $o]:(~((~(some @ X3)<=amone @ X3))=>X3 @ (ind @ X3)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', oneax)). 100.39/100.65 thf(m, axiom, some @ (^[X2:nat]:(ts @ (num @ x) @ (den @ y))=(pl @ (ts @ (num @ y) @ (den @ x)) @ X2)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', m)). 100.39/100.65 thf(satz8b, axiom, ![X13:nat, X14:nat]:amone @ (^[X15:nat]:(X13)=(pl @ X14 @ X15)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', satz8b)). 100.39/100.65 thf(satz57, axiom, ![X8:nat, X9:nat, X7:nat]:eq @ (pf @ (fr @ X8 @ X7) @ (fr @ X9 @ X7)) @ (fr @ (pl @ X8 @ X9) @ X7), file('/export/starexec/sandbox/benchmark/theBenchmark.p', satz57)). 100.39/100.65 thf(satz40a, axiom, ![X4:frac, X7:nat]:eq @ (fr @ (ts @ (num @ X4) @ X7) @ (ts @ (den @ X4) @ X7)) @ X4, file('/export/starexec/sandbox/benchmark/theBenchmark.p', satz40a)). 100.39/100.65 thf(satz40, axiom, ![X4:frac, X7:nat]:eq @ X4 @ (fr @ (ts @ (num @ X4) @ X7) @ (ts @ (den @ X4) @ X7)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', satz40)). 100.39/100.65 thf(c_0_11, plain, ![X1:nat]:(epred1_1 @ X1<=>(ts @ (num @ x) @ (den @ y))=(pl @ (ts @ (num @ y) @ (den @ x)) @ X1)), introduced(definition)). 100.39/100.65 thf(c_0_12, plain, ![X4:frac, X5:frac, X6:frac]:(eq @ X4 @ X5=>(eq @ X5 @ X6=>eq @ X4 @ X6)), inference(fof_simplification,[status(thm)],[satz39])). 100.39/100.65 thf(c_0_13, negated_conjecture, ~eq @ (pf @ y @ (fr @ (ind @ epred1_1) @ (ts @ (den @ x) @ (den @ y)))) @ x, inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[satz67c]), c_0_11])])). 100.39/100.65 thf(c_0_14, plain, ![X37:frac, X38:frac, X39:frac]:(~eq @ X37 @ X38|(~eq @ X38 @ X39|eq @ X37 @ X39)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])). 100.39/100.65 thf(c_0_15, plain, ![X4:frac, X5:frac, X6:frac, X10:frac]:(eq @ X4 @ X5=>(eq @ X6 @ X10=>eq @ (pf @ X4 @ X6) @ (pf @ X5 @ X10))), inference(fof_simplification,[status(thm)],[satz56])). 100.39/100.65 thf(c_0_16, negated_conjecture, ~eq @ (pf @ y @ (fr @ (ind @ epred1_1) @ (ts @ (den @ x) @ (den @ y)))) @ x, inference(split_conjunct,[status(thm)],[c_0_13])). 100.39/100.65 thf(c_0_17, plain, ![X4:frac, X5:frac, X6:frac]:(eq @ X4 @ X6|~eq @ X4 @ X5|~eq @ X5 @ X6), inference(split_conjunct,[status(thm)],[c_0_14])). 100.39/100.65 thf(c_0_18, plain, ![X45:frac, X46:frac, X47:frac, X48:frac]:(~eq @ X45 @ X46|(~eq @ X47 @ X48|eq @ (pf @ X45 @ X47) @ (pf @ X46 @ X48))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_15])])). 100.39/100.65 thf(c_0_19, negated_conjecture, ![X4:frac]:(~eq @ (pf @ y @ (fr @ (ind @ epred1_1) @ (ts @ (den @ x) @ (den @ y)))) @ X4|~eq @ X4 @ x), inference(spm,[status(thm)],[c_0_16, c_0_17])). 100.39/100.65 thf(c_0_20, plain, ![X4:frac, X5:frac, X6:frac, X10:frac]:(eq @ (pf @ X4 @ X6) @ (pf @ X5 @ X10)|~eq @ X4 @ X5|~eq @ X6 @ X10), inference(split_conjunct,[status(thm)],[c_0_18])). 100.39/100.65 thf(c_0_21, plain, ![X53:frac]:eq @ X53 @ X53, inference(variable_rename,[status(thm)],[satz37])). 100.39/100.65 thf(c_0_22, plain, ![X56:nat]:((~epred1_1 @ X56|(ts @ (num @ x) @ (den @ y))=(pl @ (ts @ (num @ y) @ (den @ x)) @ X56))&((ts @ (num @ x) @ (den @ y))!=(pl @ (ts @ (num @ y) @ (den @ x)) @ X56)|epred1_1 @ X56)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])). 100.39/100.65 thf(c_0_23, plain, ![X51:nat, X52:nat]:(ts @ X51 @ X52)=(ts @ X52 @ X51), inference(variable_rename,[status(thm)],[satz29])). 100.39/100.65 thf(c_0_24, plain, ![X3:nat > $o]:(~((amone @ X3=>~some @ X3))=>X3 @ (ind @ X3)), inference(fof_simplification,[status(thm)],[oneax])). 100.39/100.65 thf(c_0_25, plain, ![X15:nat, X13:nat, X14:nat]:(epred2_3 @ X14 @ X13 @ X15<=>(X13)=(pl @ X14 @ X15)), introduced(definition)). 100.39/100.65 thf(c_0_26, negated_conjecture, ![X4:frac, X5:frac]:(~eq @ (fr @ (ind @ epred1_1) @ (ts @ (den @ x) @ (den @ y))) @ X4|~eq @ (pf @ X5 @ X4) @ x|~eq @ y @ X5), inference(spm,[status(thm)],[c_0_19, c_0_20])). 100.39/100.65 thf(c_0_27, plain, ![X4:frac]:eq @ X4 @ X4, inference(split_conjunct,[status(thm)],[c_0_21])). 100.39/100.65 thf(c_0_28, plain, ![X1:nat]:((ts @ (num @ x) @ (den @ y))=(pl @ (ts @ (num @ y) @ (den @ x)) @ X1)|~epred1_1 @ X1), inference(split_conjunct,[status(thm)],[c_0_22])). 100.39/100.65 thf(c_0_29, plain, ![X2:nat, X1:nat]:(ts @ X1 @ X2)=(ts @ X2 @ X1), inference(split_conjunct,[status(thm)],[c_0_23])). 100.39/100.65 thf(c_0_30, plain, ![X36:nat > $o]:(~amone @ X36|~some @ X36|X36 @ (ind @ X36)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_24])])). 100.39/100.65 thf(c_0_31, axiom, some @ epred1_1, inference(apply_def,[status(thm)],[m, c_0_11])). 100.39/100.65 thf(c_0_32, axiom, ![X13:nat, X14:nat]:amone @ (epred2_3 @ X14 @ X13), inference(apply_def,[status(thm)],[satz8b, c_0_25])). 100.39/100.65 thf(c_0_33, negated_conjecture, ![X4:frac]:(~eq @ (pf @ X4 @ (fr @ (ind @ epred1_1) @ (ts @ (den @ x) @ (den @ y)))) @ x|~eq @ y @ X4), inference(spm,[status(thm)],[c_0_26, c_0_27])). 100.39/100.65 thf(c_0_34, plain, ![X42:nat, X43:nat, X44:nat]:eq @ (pf @ (fr @ X42 @ X44) @ (fr @ X43 @ X44)) @ (fr @ (pl @ X42 @ X43) @ X44), inference(variable_rename,[status(thm)],[satz57])). 100.39/100.65 thf(c_0_35, plain, ![X1:nat]:((pl @ (ts @ (den @ x) @ (num @ y)) @ X1)=(ts @ (den @ y) @ (num @ x))|~epred1_1 @ X1), inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_28, c_0_29]), c_0_29])). 100.39/100.65 thf(c_0_36, plain, ![X3:nat > $o]:(X3 @ (ind @ X3)|~amone @ X3|~some @ X3), inference(split_conjunct,[status(thm)],[c_0_30])). 100.39/100.65 thf(c_0_37, plain, some @ epred1_1, inference(split_conjunct,[status(thm)],[c_0_31])). 100.39/100.65 thf(c_0_38, plain, ![X54:nat, X55:nat]:amone @ (epred2_3 @ X55 @ X54), inference(variable_rename,[status(thm)],[c_0_32])). 100.39/100.65 thf(c_0_39, negated_conjecture, ![X4:frac, X5:frac]:(~eq @ (pf @ X4 @ (fr @ (ind @ epred1_1) @ (ts @ (den @ x) @ (den @ y)))) @ X5|~eq @ y @ X4|~eq @ X5 @ x), inference(spm,[status(thm)],[c_0_33, c_0_17])). 100.39/100.65 thf(c_0_40, plain, ![X1:nat, X7:nat, X2:nat]:eq @ (pf @ (fr @ X1 @ X2) @ (fr @ X7 @ X2)) @ (fr @ (pl @ X1 @ X7) @ X2), inference(split_conjunct,[status(thm)],[c_0_34])). 100.39/100.65 thf(c_0_41, plain, ((pl @ (ts @ (den @ x) @ (num @ y)) @ (ind @ epred1_1))=(ts @ (den @ y) @ (num @ x))|~amone @ epred1_1), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35, c_0_36]), c_0_37])])). 100.39/100.65 thf(c_0_42, plain, ![X1:nat, X2:nat]:amone @ (epred2_3 @ X1 @ X2), inference(split_conjunct,[status(thm)],[c_0_38])). 100.39/100.65 thf(c_0_43, plain, ![X40:frac, X41:nat]:eq @ (fr @ (ts @ (num @ X40) @ X41) @ (ts @ (den @ X40) @ X41)) @ X40, inference(variable_rename,[status(thm)],[satz40a])). 100.39/100.65 thf(c_0_44, plain, ![X49:frac, X50:nat]:eq @ X49 @ (fr @ (ts @ (num @ X49) @ X50) @ (ts @ (den @ X49) @ X50)), inference(variable_rename,[status(thm)],[satz40])). 100.39/100.65 thf(c_0_45, negated_conjecture, ![X1:nat]:(~eq @ (fr @ (pl @ X1 @ (ind @ epred1_1)) @ (ts @ (den @ x) @ (den @ y))) @ x|~eq @ y @ (fr @ X1 @ (ts @ (den @ x) @ (den @ y)))), inference(spm,[status(thm)],[c_0_39, c_0_40])). 100.39/100.65 thf(c_0_46, plain, ![X1:nat, X2:nat]:((pl @ (ts @ (den @ x) @ (num @ y)) @ (ind @ epred1_1))=(ts @ (den @ y) @ (num @ x))|(epred2_3 @ X1 @ X2)!=(epred1_1)), inference(ext_sup,[status(thm)],[c_0_41, c_0_42])). 100.39/100.65 thf(c_0_47, plain, ![X1:nat, X4:frac]:eq @ (fr @ (ts @ (num @ X4) @ X1) @ (ts @ (den @ X4) @ X1)) @ X4, inference(split_conjunct,[status(thm)],[c_0_43])). 100.39/100.65 thf(c_0_48, plain, ![X4:frac, X1:nat]:eq @ X4 @ (fr @ (ts @ (num @ X4) @ X1) @ (ts @ (den @ X4) @ X1)), inference(split_conjunct,[status(thm)],[c_0_44])). 100.39/100.65 thf(c_0_49, negated_conjecture, ![X1:nat, X2:nat]:((epred2_3 @ X1 @ X2)!=(epred1_1)|~eq @ (fr @ (ts @ (den @ y) @ (num @ x)) @ (ts @ (den @ x) @ (den @ y))) @ x|~eq @ y @ (fr @ (ts @ (den @ x) @ (num @ y)) @ (ts @ (den @ x) @ (den @ y)))), inference(spm,[status(thm)],[c_0_45, c_0_46])). 100.39/100.65 thf(c_0_50, plain, ![X1:nat, X4:frac]:eq @ (fr @ (ts @ X1 @ (num @ X4)) @ (ts @ (den @ X4) @ X1)) @ X4, inference(spm,[status(thm)],[c_0_47, c_0_29])). 100.39/100.65 thf(c_0_51, plain, ![X1:nat, X4:frac]:eq @ X4 @ (fr @ (ts @ (num @ X4) @ X1) @ (ts @ X1 @ (den @ X4))), inference(spm,[status(thm)],[c_0_48, c_0_29])). 100.39/100.65 thf(c_0_52, negated_conjecture, ![X1:nat, X2:nat]:((epred2_3 @ X1 @ X2)!=(epred1_1)|~eq @ y @ (fr @ (ts @ (den @ x) @ (num @ y)) @ (ts @ (den @ x) @ (den @ y)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_49, c_0_50])])). 100.39/100.65 thf(c_0_53, plain, ![X1:nat, X4:frac]:eq @ X4 @ (fr @ (ts @ X1 @ (num @ X4)) @ (ts @ X1 @ (den @ X4))), inference(spm,[status(thm)],[c_0_51, c_0_29])). 100.39/100.65 thf(c_0_54, negated_conjecture, ![X1:nat, X2:nat]:(epred2_3 @ X1 @ X2)!=(epred1_1), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_52, c_0_53])])). 100.39/100.65 thf(c_0_55, plain, ![X57:nat, X58:nat, X59:nat]:((~epred2_3 @ X59 @ X58 @ X57|(X58)=(pl @ X59 @ X57))&((X58)!=(pl @ X59 @ X57)|epred2_3 @ X59 @ X58 @ X57)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_25])])). 100.39/100.65 thf(c_0_56, negated_conjecture, ![X1:nat, X2:nat]:(epred2_3 @ X1 @ X2 @ (esk7_2 @ X1 @ X2))!=(epred1_1 @ (esk7_2 @ X1 @ X2)), inference(neg_ext,[status(thm)],[c_0_54])). 100.39/100.65 thf(c_0_57, plain, ![X1:nat, X2:nat, X7:nat]:((X2)=(pl @ X1 @ X7)|~epred2_3 @ X1 @ X2 @ X7), inference(split_conjunct,[status(thm)],[c_0_55])). 100.39/100.65 thf(c_0_58, negated_conjecture, ![X1:nat, X2:nat]:(epred2_3 @ X1 @ X2 @ (esk7_2 @ X1 @ X2)|epred1_1 @ (esk7_2 @ X1 @ X2)), inference(dynamic cnf,[status(thm)],[c_0_56])). 100.39/100.65 thf(c_0_59, plain, ![X1:nat, X2:nat]:((pl @ X1 @ (esk7_2 @ X1 @ X2))=(X2)|epred1_1 @ (esk7_2 @ X1 @ X2)), inference(spm,[status(thm)],[c_0_57, c_0_58])). 100.39/100.65 thf(c_0_60, plain, ![X1:nat, X2:nat, X7:nat]:(epred2_3 @ X2 @ X1 @ X7|(X1)!=(pl @ X2 @ X7)), inference(split_conjunct,[status(thm)],[c_0_55])). 100.39/100.65 thf(c_0_61, plain, ![X1:nat, X2:nat]:((pl @ (ts @ (den @ x) @ (num @ y)) @ (esk7_2 @ X1 @ X2))=(ts @ (den @ y) @ (num @ x))|(pl @ X1 @ (esk7_2 @ X1 @ X2))=(X2)), inference(spm,[status(thm)],[c_0_35, c_0_59])). 100.39/100.65 thf(c_0_62, plain, ![X1:nat, X2:nat]:epred2_3 @ X1 @ (pl @ X1 @ X2) @ X2, inference(er,[status(thm)],[c_0_60])). 100.39/100.65 thf(c_0_63, plain, (pl @ (ts @ (den @ x) @ (num @ y)) @ (esk7_2 @ (ts @ (den @ x) @ (num @ y)) @ (ts @ (den @ y) @ (num @ x))))=(ts @ (den @ y) @ (num @ x)), inference(er,[status(thm)],[inference(ef,[status(thm)],[c_0_61])])). 100.39/100.65 thf(c_0_64, negated_conjecture, ![X1:nat, X2:nat]:(~epred2_3 @ X1 @ X2 @ (esk7_2 @ X1 @ X2)|~epred1_1 @ (esk7_2 @ X1 @ X2)), inference(dynamic cnf,[status(thm)],[c_0_56])). 100.39/100.65 thf(c_0_65, plain, epred2_3 @ (ts @ (den @ x) @ (num @ y)) @ (ts @ (den @ y) @ (num @ x)) @ (esk7_2 @ (ts @ (den @ x) @ (num @ y)) @ (ts @ (den @ y) @ (num @ x))), inference(spm,[status(thm)],[c_0_62, c_0_63])). 100.39/100.65 thf(c_0_66, plain, ![X1:nat]:(epred1_1 @ X1|(ts @ (num @ x) @ (den @ y))!=(pl @ (ts @ (num @ y) @ (den @ x)) @ X1)), inference(split_conjunct,[status(thm)],[c_0_22])). 100.39/100.65 thf(c_0_67, negated_conjecture, ~epred1_1 @ (esk7_2 @ (ts @ (den @ x) @ (num @ y)) @ (ts @ (den @ y) @ (num @ x))), inference(spm,[status(thm)],[c_0_64, c_0_65])). 100.39/100.65 thf(c_0_68, plain, ![X1:nat]:(epred1_1 @ X1|(pl @ (ts @ (den @ x) @ (num @ y)) @ X1)!=(ts @ (den @ y) @ (num @ x))), inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_66, c_0_29]), c_0_29])). 100.39/100.65 thf(c_0_69, plain, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67, c_0_68]), c_0_63])]), ['proof']). 100.39/100.65 # SZS output end CNFRefutation 100.39/100.65 # Proof object total steps : 70 100.39/100.65 # Proof object clause steps : 40 100.39/100.65 # Proof object formula steps : 30 100.39/100.65 # Proof object conjectures : 15 100.39/100.65 # Proof object clause conjectures : 13 100.39/100.65 # Proof object formula conjectures : 2 100.39/100.65 # Proof object initial clauses used : 15 100.39/100.65 # Proof object initial formulas used : 11 100.39/100.65 # Proof object generating inferences : 16 100.39/100.65 # Proof object simplifying inferences : 14 100.39/100.65 # Training examples: 0 positive, 0 negative 100.39/100.65 # Parsed axioms : 25 100.39/100.65 # Removed by relevancy pruning/SinE : 0 100.39/100.65 # Initial clauses : 29 100.39/100.65 # Removed in clause preprocessing : 14 100.39/100.65 # Initial clauses in saturation : 15 100.39/100.65 # Processed clauses : 1003 100.39/100.65 # ...of these trivial : 11 100.39/100.65 # ...subsumed : 758 100.39/100.65 # ...remaining for further processing : 234 100.39/100.65 # Other redundant clauses eliminated : 11 100.39/100.65 # Clauses deleted for lack of memory : 0 100.39/100.65 # Backward-subsumed : 2 100.39/100.65 # Backward-rewritten : 5 100.39/100.65 # Generated clauses : 5580 100.39/100.65 # ...of the previous two non-trivial : 5491 100.39/100.65 # Contextual simplify-reflections : 0 100.39/100.65 # Paramodulations : 5540 100.39/100.65 # Factorizations : 2 100.39/100.65 # NegExts : 7 100.39/100.65 # Equation resolutions : 11 100.39/100.65 # Propositional unsat checks : 0 100.39/100.65 # Propositional check models : 0 100.39/100.65 # Propositional check unsatisfiable : 0 100.39/100.65 # Propositional clauses : 0 100.39/100.65 # Propositional clauses after purity: 0 100.39/100.65 # Propositional unsat core size : 0 100.39/100.65 # Propositional preprocessing time : 0.000 100.39/100.65 # Propositional encoding time : 0.000 100.39/100.65 # Propositional solver time : 0.000 100.39/100.65 # Success case prop preproc time : 0.000 100.39/100.65 # Success case prop encoding time : 0.000 100.39/100.65 # Success case prop solver time : 0.000 100.39/100.65 # Current number of processed clauses : 206 100.39/100.65 # Positive orientable unit clauses : 15 100.39/100.65 # Positive unorientable unit clauses: 1 100.39/100.65 # Negative unit clauses : 16 100.39/100.65 # Non-unit-clauses : 174 100.39/100.65 # Current number of unprocessed clauses: 4516 100.39/100.65 # ...number of literals in the above : 20725 100.39/100.65 # Current number of archived formulas : 0 100.39/100.65 # Current number of archived clauses : 27 100.39/100.65 # Clause-clause subsumption calls (NU) : 19369 100.39/100.65 # Rec. Clause-clause subsumption calls : 10371 100.39/100.65 # Non-unit clause-clause subsumptions : 591 100.39/100.65 # Unit Clause-clause subsumption calls : 156 100.39/100.65 # Rewrite failures with RHS unbound : 0 100.39/100.65 # BW rewrite match attempts : 54 100.39/100.65 # BW rewrite match successes : 8 100.39/100.65 # Condensation attempts : 0 100.39/100.65 # Condensation successes : 0 100.39/100.65 # Termbank termtop insertions : 129338 100.39/100.65 100.39/100.65 # ------------------------------------------------- 100.39/100.65 # User time : 97.657 s 100.39/100.65 # System time : 2.641 s 100.39/100.65 # Total time : 100.298 s 100.39/100.65 # Maximum resident set size: 1672 pages 100.39/100.66 EOF